A monotonic and continuous two-dimensional warping based on dynamic programming
نویسندگان
چکیده
A novel two-dimensional warping algorithm is presented which searches for the optimal pixel mapping subject to continuity and monotonicity constraints. These constraints enable us to preserve topological structure in images. The search algorithm is based on dynamic programming (DP). As implementation techniques, acceleration by beam search and excessive warp suppression by penalty and/or range limitation are investigated. Experimental results show that this method provides successful warpings between images.
منابع مشابه
Handwritten Character Recognition using Monotonic and Continuous Two-dimensional Warping
In this paper, a handwritten character recognition experiment using a monotonic and continuous twodimensional warping algorithm is reported. This warping algorithm is based on dynamic programming and searches for the optimal pixel-to-pixel mapping between given two images subject to two-dimensional monotonicity and continuity constraints. Experimental comparisons with rigid matching and local p...
متن کاملAn E cient Two - Dimensional Warping Algorithm
A new dynamic programming (DP) based algorithm for monotonic and continuous two-dimensional warping (2DW) is presented. This algorithm searches for the optimal pixel-to-pixel mapping between a pair of images subject to monotonicity and continuity constraints with by far less time complexity than the algorithm previously reported by the authors. This complexity reduction results from a re nement...
متن کاملHandwritten Character Recognition Using Piecewise Linear Two-Dimensional Warping
In this paper, the effectiveness of piecewise linear two-dimensional warping, a dynamic programming-based elastic image matching technique, in handwritten character recognition is investigated. The present technique is capable of providing compensation for most variations in character patterns while its computation remains tractable. The superiority of the present technique over several convent...
متن کاملAn Approximation Algorithm for Two-Dimensional Warping∗
A new efficient two-dimensional warping algorithm is presented, in which sub-optimal warping is attained by iterating DP-based local optimization of warp on partially overlapping subplane sequence. From an experimental comparison with a conventional approximation algorithm based on beam search DP, relative superiority of the proposed algorithm is established. key words: two-dimensional warping,...
متن کاملStochastic Dynamic Programming with Markov Chains for Optimal Sustainable Control of the Forest Sector with Continuous Cover Forestry
We present a stochastic dynamic programming approach with Markov chains for optimal control of the forest sector. The forest is managed via continuous cover forestry and the complete system is sustainable. Forest industry production, logistic solutions and harvest levels are optimized based on the sequentially revealed states of the markets. Adaptive full system optimization is necessary for co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998